The time to read the input and initialise the problem = 312 ms
The time to create the LP bound problem = 0 ms
The time to compute the linear programming bound = 94 ms
The linear programming lower bound on the solution is:
x11=0.000000
x12=1.000000
x13=0.000000
x14=0.000000
x15=0.000000
x21=0.000000
x22=0.000000
x23=0.000000
x24=1.000000
x25=0.000000
x31=0.000000
x32=1.000000
x33=0.000000
x34=0.000000
x35=0.000000
x41=0.073171
x42=0.000000
x43=0.926829
x44=0.000000
x45=0.000000
x51=0.073171
x52=0.000000
x53=0.000000
x54=0.926829
x55=0.000000
x61=0.000000
x62=0.000000
x63=0.716609
x64=0.283391
x65=0.000000
x71=0.007317
x72=0.000000
x73=0.000000
x74=0.992683
x75=0.000000
x81=0.073171
x82=0.000000
x83=0.000000
x84=0.926829
x85=0.000000
x91=0.073171
x92=0.850000
x93=0.076829
x94=0.000000
x95=0.000000
x101=0.000000
x102=1.000000
x103=0.000000
x104=0.000000
x105=0.000000
y1=0.073171
y2=1.000000
y3=1.000000
y4=1.000000
y5=0.000000
z1=0.367698
z2=0.065934
z3=0.155405
w11=0.000000
w12=0.000000
w13=24.000000
w14=83.000000
w15=0.000000
w21=6.000000
w22=0.000000
w23=0.000000
w24=0.000000
w25=0.000000
w31=0.000000
w32=69.000000
w33=0.000000
w34=0.000000
w35=0.000000
z=49817.328527
The time to read the LP bound solution = 16 ms
Run time is 1422 ms
